Choosing starting values for certain Newton–Raphson iterations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choosing starting values for certain Newton-Raphson iterations

We aim at finding the best possible seed values when computing a1/p using the Newton–Raphson iteration in a given interval. 7 A natural choice of the seed value would be the one that best approximates the expected result. It turns out that in most cases, the best seed value can be quite far from this natural choice. When we evaluate a monotone function f (a) in the interval [amin, amax], 9 by b...

متن کامل

Canonical Heights for Random Iterations in Certain Varieties

We show the existence of canonical heights (normalized heights) of subvarieties for bounded sequences of morphisms and give some applications.

متن کامل

Choosing initial values for the EM algorithm for finite mixtures

The EM algorithm is the standard tool for maximum likelihood estimation in )nite mixture models. The main drawbacks of the EM algorithm are its slow convergence and the dependence of the solution on both the stopping criterion and the initial values used. The problems referring to slow convergence and the choice of a stopping criterion have been dealt with in literature and the present paper de...

متن کامل

Patient values and preferences when choosing anticoagulants

BACKGROUND New oral anticoagulants have similar efficacy and lower bleeding rates compared with warfarin. However, in case of bleeding there is no specific antidote to reverse their effects. We evaluated the preferences and values of anticoagulants of patients at risk of atrial fibrillation and those who have already made a decision regarding anticoagulation. METHODS We conducted a cross-sect...

متن کامل

The Critical Values of Certain Dirichlet Series

We investigate the values of several types of Dirichlet series D(s) for certain integer values of s, and give explicit formulas for the value D(s) in many cases. The easiest types of D are Dirichlet L-functions and their variations; a somewhat more complex case involves elliptic functions. There is one new type that includes ∑∞ n=1(n +1) for which such values have not been studied previously. 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2006

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.09.056